Symmetric multistep methods for constrained Hamiltonian systems
نویسندگان
چکیده
منابع مشابه
Symmetric multistep methods for constrained Hamiltonian systems
A method of choice for the long-time integration of constrained Hamiltonians systems is the Rattle algorithm. It is symmetric, symplectic, and nearly preserves the Hamiltonian, but it is only of order two and thus not efficient for high accuracy requirements. In this article we prove that certain symmetric linear multistep methods have the same qualitative behavior and can achieve an arbitraril...
متن کاملSymmetric multistep methods for charged - particle dynamics
A class of explicit symmetric multistep methods is proposed for integrating the equations of motion of charged particles in an electro-magnetic field. The magnetic forces are built into these methods in a special way that respects the Lagrangian structure of the problem. It is shown that such methods approximately preserve energy and momentum over very long times, proportional to a high power o...
متن کاملResonances and instabilities in symmetric multistep methods
The symmetric multistep methods developed by Quinlan and Tremaine (1990) are shown to suffer from resonances and instabilities at special stepsizes when used to integrate nonlinear equations. This property of symmetric multistep methods was missed in previous studies that considered only the linear stability of the methods. The resonances and instabilities are worse for high-order methods than ...
متن کاملSymplectic Integration of Constrained Hamiltonian Systems by Composition Methods
Recent work reported in the literature suggests that for the long-term integration of Hamiltonian dynamical systems one should use methods that preserve the symplectic structure of the ow. In this paper we investigate the symplecticity of numerical integrators for constrained Hamiltonian systems with holonomic constraints. We will derive the following two results: (i) We show that any rst or se...
متن کاملSymmetric parareal algorithms for Hamiltonian systems
The parareal in time algorithm allows to efficiently use parallel computing for the simulation of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictorcorrector strategy, where the propagations over each subinterval for the corrector stage are concurrently performed on the processors. In this article, we are concerned with the long ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2013
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-013-0522-z